Online Checkpointing with Improved Worst-Case Guarantees
نویسندگان
چکیده
منابع مشابه
Online checkpointing with improved worst-case guarantees
In the online checkpointing problem, the task is to continuously maintain a set of k checkpoints that allow to rewind an ongoing computation faster than by a full restart. The only operation allowed is to replace an old checkpoint by the current state. Our aim are checkpoint placement strategies that minimize rewinding cost, i.e., such that at all times T when requested to rewind to some time t...
متن کاملSuccinct Online Dictionary Matching with Improved Worst-Case Guarantees
In the online dictionary matching problem the goal is to preprocess a set of patterns D = {P1, . . . , Pd} over alphabet Σ, so that given an online text (one character at a time) we report all of the occurrences of patterns that are a suffix of the current text before the following character arrives. We introduce a succinct Aho-Corasick like data structure for the online dictionary matching pro...
متن کاملCoalition Structure Generation with Worst Case Guarantees
Coalition formation is a key topic in multiagent systems. One may prefer a coalition structure that maximizes the sum of the values of the coalitions, but often the number of coalition structures is too large to allow exhaustive search for the optimal one. Furthermore, nding the optimal coalition structure is NP-complete. But then, can the coalition structure found via a partial search be guara...
متن کاملAn Improved Worst - Case to Average - CaseConnection
We improve a connection of the worst-case complexity and the average-case complexity of some well-known lattice problems. This fascinating connection was rst discovered by Ajtai 1] in 1996. We improve the exponent of this connection from 8 to 3:5 + .
متن کاملDesigning smoothing functions for improved worst-case competitive ratio in online optimization
Online optimization covers problems such as online resource allocation, online bipartite matching, adwords (a central problem in e-commerce and advertising), and adwords with separable concave returns. We analyze the worst case competitive ratio of two primal-dual algorithms for a class of online convex (conic) optimization problems that contains the previous examples as special cases defined o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2015
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.2014.0639